The Quorum Deployment Problem ( Extended
نویسنده
چکیده
Quorum systems are commonly used to maintain the consistency of replicated data in a distributed system. Much research has been devoted to developing quorum systems with good theoretical properties, such as fault tolerance and high availability. However, even given a theoretically good quorum system, it is not obvious how to efficiently deploy such a system in a real network. This paper introduces a new combinatorial optimization problem, the Quorum Deployment Problem, and studies its complexity. We demonstrate that it is NP-hard to approximate the Quorum Deployment Problem within any factor of n, where n is the number of nodes in the distributed network and δ > 0. The problem is NP-hard in even the simplest possible distributed network: a one-dimensional line with metric cost. We begin to study algorithms for variants of the problem. Some variants can be solved optimally in polynomial time and some NP-hard variants can be approximated to within a constant factor.
منابع مشابه
The Quorum Deployment Problem
Quorum systems are commonly used to maintain the consistency of replicated data in a distributed system. Much research has been devoted to developing quorum systems with good theoretical properties, such as fault tolerance and high availability. However, even given a theoretically good quorum system, it is not obvious how to efficiently deploy such a system in a real network. This paper introdu...
متن کاملApplication of quality function deployment (QFD) to improve product design: The school furniture case
Today Quality Function Deployment (QFD) is a powerful development method whit a wide range of applications to translate customers’ needs into technical requirements for achieving customer satisfaction. The current study demonstrated a QFD analysis to improve school furniture design in Tehran as the baseline of Iran. Accordingly, we extended the widely used QFD method into a complex set of custo...
متن کاملAn Improved Quorum-Based Algorithm for Extended GME Problem in Distributed Systems
The extended GME (group mutual exclusion) problem is a natural extension of the GME problem. In extended GME problem, processes are allowed to request more than one resource at a time, in order that the processes that can proceed by having access to any one of the requested resource can be allowed to do so. Manabe-Park suggested a quorum based solution for the extended GME problem. However, the...
متن کاملLoad Balancing and Almost Symmetries for RAMBO Quorum Hosting
Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where the participating hosts may join, leave, or fail. Rambo is particularly suited for volatile environments such as mobile networks. To maintain availability and consistency in such dynamic settings, Rambo replicates objects and uses...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004